Scribe : Chris Mattioli Lecture 7 : Scheduling 1 Ordinary Load Balancing
نویسندگان
چکیده
Let J = {j1, j2, . . . jn} be a set of n jobs such that each job, ji, has its own processing time ti. Let M = {M1,M2, . . .Mm} be a set of machines. Let A(i) denote the set of jobs assigned to machine Mi, and let T (i) = ∑ j∈A(i) tj. Define the “makespan”, MS, as maxi T (i). In general, the goal of load balancing is to find a schedule that minimizes the “makespan”. A schedule in this case is some matching between jobs and machines.
منابع مشابه
Semester , 2003 / 4 Lecture 9 : Dynamics in Load Balancing
In this lecture we consider dynamics of a load balancing system. We study the number of steps required to reach pure Nash equilibrium in a system of ”selfish” and greedy players (jobs). We are interested in the convergence time to Nash equilibrium, rather than the quality of the allocation. We consider a variety of load balancing models including identical, restricted, related and unrelated mac...
متن کاملComputational Game Theory Spring Semester , 2011 / 2012 Lecture 3 : March 7
In the previous lectures we talked about the inefficiency of equilibrium states. We defined the concepts of the Price of Anarchy (PoA) and the Price of Stability (PoS). We mentioned two problems: 1. Infinitesimal Flows-For which we showed that an equilibrium state can be suboptimal. We talked of Brass Paradox, as a situation where adding another channel or route actually decreases the performan...
متن کاملTheorem 1
In the last lecture, we studied the KNAPSACK problem. The KNAPSACK problem is an NP-hard problem but does admit a pseudo-polynomial time algorithm and can be solved efficiently if the input size is small. We used this pseudo-polynomial time algorithm to obtain an FPTAS for KNAPSACK. In this lecture, we study another class of problems, known as strongly NP-hard problems. Definition 1 (Strongly N...
متن کاملInstructor: Chandra Chekuri Scribe: Omid Fatemieh Contents
In a game (N, 〈Si〉, 〈ui〉) players are interested in maximizing ui. In this section we consider games where players incur costs, and hence their goal is to minimize costs. These games are represented as (N, 〈Si〉, 〈ci〉) where ci is the cost function of player i. Recall that we defined a potential function to prove that a load balancing game had a pure Nash equilibrium. In this section we define a...
متن کاملInvestigational Study of 7 Effective Schemes of Load Balancing in Cloud Computing
With the exponential increase in demands of online applications and services, cloud computing has evolved as a boon in modern information technology. Built over the base of grid and distributed computing, cloud computing offers services to cater the dynamic needs of massive user base. However, with the novelty associated with the system, cloud computing is also associated with certain issues li...
متن کامل